Performance of a Simplified Soft-distance Decoding Algorithm for Ldpc Codes over the Rayleigh Fading Channel
نویسندگان
چکیده
In this paper, we investigate the performance of a Soft-Input soft-Output decoding algorithm for LDPC codes that uses Euclidean distance as its metric, in the Rayleigh fading channel. It is found that its Bit Error Rate performance is close to that of traditional decoding algorithms like the SumProduct algorithm and its logarithmic version. Main characteristics of the proposed algorithm and its modification to perform over the Rayleigh channel are described. This algorithm uses squared Euclidean distance as the metric, does not require knowledge of the signal-to-noise ratio of the received signal, and is less complex to implement than other soft-input, soft-output algorithms.
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملError Performance of Decoding of LDPC over AWGN Channel
The design of future communication systems with high throughput demands will become a critical task, especially when sophisticated channel coding schemes have to be applied. Low-Density Parity-Check(LDPC) codes are among the most powerful forward error correcting codes, since they enable to get as close as a fraction of a dB from the Shannon limit. A simplified decoding algorithms for decoding ...
متن کاملLow-Complexity MAP Decoding for Turbo Codes
Two simplified MAP algorithms for iterative decoding of turbo codes are presented. By using a parameter “decoding depth”, our algorithms do not require computation of the aposteriori probability of each decoded information bit throughout the entire trellis, thus reduce the computational complexity and decoding delay considerably. One of the algorithms can achieve the performance very close to t...
متن کاملPerformance of parallel and serial concatenated codes on fading channels
The performance of parallel and serial concatenated codes on frequency-nonselective fading channels is considered. The analytical average upper bounds of the code performance over the Rician channels with independent fading are derived. Furthermore, the log-likelihood ratios and extrinsic information for maximum a posteriori (MAP) probability and soft-output Viterbi algorithm (SOVA) decoding me...
متن کامل